On terrain acquisition by a finite-sized mobile robot in plane

نویسندگان

  • Nageswara S. V. Rao
  • S. Sitharama Iyengar
  • C. C. Jorgensen
  • Charles R. Weisbin
چکیده

The terrain acquisition problem deals with the acquisition of the complete obstacle terrain model by a mobile robot placed in an unexplored terrain. This is a precursory problem to many well-known find-path and related problems which assume the availability of the complete terrain model. In this paper, we present a method for terrain acquisition by a finitesized robot operating in plane populated by an unknown (but, finite) number of polygonal obstacles; each obstacle is arbitrarily located and has unknown (but, finite) number of vertices. The robot progressively explores newer vertices of the obstacles using sensor equipment. We show that the complete terrain model will be built by the robot in a finite time. We also show that at any point of time the partially acquired terrain suffices for the navigation of the robot during the exploration. Hence we conclude that the navigation techniques for known terrains can be applied for the robot navigation during exploration.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A 'retraction' method for terrain model acquisition

We consider the following problem (called the terrain model acquisition problem): A point robot R is placed in a finite-sized two-dimensional obstacle terrain populated by a set 0 = {01,02, ,On} of unknown polygonal obstacles. Each obstacle Oi is a finite-sized polygon with a finite number of vertices. Initially the number of obstacles in the terrain is unknown to R . And also, the number and t...

متن کامل

Autonomous robot navigation in unknown terrains: incidental learning and environmental exploration

The navigation of autonomous mobile machines, which are referred to as robots, through unknown terrains, i.e., terrains whose models are not a priori known is considered. We deal with point-sized robots in twoand three-dimensional terrains and circular robots in two-dimensional terrains. The two-dimensional (three-dimensional) terrains are finite-sized and populated by an unknown, hut, finite, ...

متن کامل

Terrain Model Acquisition by Mobile Robot Teams and n-Connectivity

The connectivity of the con guration space has been a valuable concept in the motion planning for single robots in both known and unknown terrains. We show here that n-connectivity plays a similar role for mobile robot teams in providing algorithms for terrain model acquisition in unknown terrains. A bound on the connectivity degree of the free-space, re ected in that of a navigation course, pr...

متن کامل

Maximum Allowable Dynamic Load of Flexible 2-Link Mobile Manipulators Using Finite Element Approach

In this paper a general formulation for finding the maximum allowable dynamic load (MADL) of flexible link mobile manipulators is presented. The main constraints used for the algorithm presented are the actuator torque capacity and the limited error bound for the end-effector during motion on the given trajectory. The precision constraint is taken into account with two boundary lines in plane w...

متن کامل

A Method For Mobile Robot Obstacle Negotiation

This paper presents an obstacle negotiation method for mobile robot navigation. The proposed method first transforms a local terrain map surrounding the robot’s momentary position into a grid-type traversability map by extracting the slope and roughness of a terrain patch through least-squares plane-fitting. It then evaluates the overall traversal property along each direction. The traversal in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987